Cross-Monotone Subsequences

نویسندگان

  • F. R. K. CHUNG
  • P. C. FISHBURN
چکیده

Two finite real sequences (aI , . . . . ak) and (b, , . . . . bk) are cross-monotone if each is nondecreasing and ai + 1 -ci > bi + 1 bt for all i < k. A sequence ((x, , . . . , on) of nondecreasing reals is in class CM(k) if it has disjoint k-term subsequences that are cross-monotone. The paper shows that f(k), the smallest n such that every nondecreasing (o, , . . . , on) is in CM(k), is bounded between about ka/4 and k”/2. It also shows that g(k), the smallest n for which all (CY~, . . . . on) are in CM(k) and either ak < b, or bk < a,, equals k(k 1) + 2, and that h(k), the smallest n for which all (o, , . . , orn) are in CM(k) and either a, < b, < ‘1. G ak < bk or b, < a, < ... < bk Q ak, equals 2(k 1)’ + 2. The results for f and g rely on new theorems for regular patterns in (0, 1)-matrices that are of interest in their own right. An example is: Every upper-triangular kz x ka (0, l)-matrix has either k I’s in consecutive columns, each below its predecessor, or k O’s in consecutive rows, each to the right of its predecessor, and the same conclusion is false when k’ is replaced by k’ 1. AMS (MOS) subject classifications (1980): Primary: 06A99; secondary: 05A05

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Minimum Number of Monotone Subsequences

Erdős and Szekeres showed that any permutation of length n ≥ k2 + 1 contains a monotone subsequence of length k + 1. A simple example shows that there need be no more than (n mod k) (dn/ke k+1 ) + (k − (n mod k))(bn/kc k+1 ) such subsequences; we conjecture that this is the minimum number of such subsequences. We prove this for k = 2, with a complete characterisation of the extremal permutation...

متن کامل

Monotone Subsequences in Any Dimension

We exhibit sequences of n points in d dimensions with no long monotone subsequences, by which we mean when projected in a general direction, our sequence has no monotone subsequences of length n+d or more. Previous work proved that this function of n would lie between n and 2 n; this paper establishes that the coefficient of n is one. This resolves the question of how the Erdo s Szekeres result...

متن کامل

On Boolean Lattices and Farey Sequences

We establish monotone bijections between subsequences of the Farey sequences and the halfsequences of Farey subsequences associated with elements of the Boolean lattices.

متن کامل

Enumerating Longest Increasing Subsequences and Patience Sorting Enumerating Longest Increasing Subsequences and Patience Sorting

In this paper we present three algorithms that solve three combinatorial optimization problems related to each other. One of them is the patience sorting game, invented as a practical method of sorting real decks of cards. The second problem is computing the longest monotone increasing subsequence of the given sequence of n positive integers in the range 1; : : : ; n. The third problem is to en...

متن کامل

A Note on Boolean Lattices and Farey Sequences. Ii

We establish monotone bijections between subsequences of the Farey sequences and the halfsequences of Farey subsequences associated with elements of the Boolean lattices.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1985